نتایج جستجو برای: Constrained Clustering

تعداد نتایج: 178523  

2012
Jean-Philippe Métivier Patrice Boizumault Bruno Crémilleux Mehdi Khiari Samir Loudni

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...

2015
David R. Easterling Yang Cao Naren Ramakrishnan Kirk W. Cameron Jeff Borggaard William Thacker

One of the main techniques used in data mining is data clustering, which has many applications in computer science, biology, and social sciences. Constrained clustering is a type of clustering in which side information provided by the user is incorporated into current clustering algorithms. One of the well researched constrained clustering algorithms is called microaggregation. In a microaggreg...

Journal: :Information Sciences 2013

Journal: :IEEE Transactions on Pattern Analysis and Machine Intelligence 2018

Journal: :International Journal of Pure and Apllied Mathematics 2013

2008
Alexander C. Loui Madirakshi Das

This paper presents an algorithm and a software application for matching complex scenes in consumer image collections. By applying appropriate constraints to detected keypoint matches between a target and reference image, complex scenes from users’ collections can be matched with very good precision. Experimental results confirm the effectiveness of this approach. The method can be further enha...

2008
Ruggero G. Pensa Jean-François Boulicaut

Résumé. Dans de nombreuses applications, une co-classification est plus facile à interpréter qu’une classification mono-dimensionnelle. Il s’agit de calculer une bi-partition ou collection de co-clusters : chaque co-cluster est un groupe d’objets associé à un groupe d’attributs et les interprétations peuvent s’appuyer naturellement sur ces associations. Pour exploiter la connaissance du domaine...

2000
Kiri Wagstaff Claire Cardie

Clustering algorithms conduct a search through the space of possible organizations of a data set. In this paper, we propose two types of instance-level clustering constraints – must-link and cannot-link constraints – and show how they can be incorporated into a clustering algorithm to aid that search. For three of the four data sets tested, our results indicate that the incorporation of surpris...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید